SecRSL: security separation logic for C11 release-acquire concurrency

We present Security Relaxed Separation Logic (SecRSL), a separation logic for proving information-flow security of C11 programs in the Release-Acquire fragment with relaxed accesses. SecRSL is first that (1) supports weak-memory reasoning about high-level language; (2) inherits logic’s virtues compositional, local (3) expressive policies like value-dependent classification. also, to our knowledge, developed over an axiomatic memory model. Thus we also definitions weak model, against which prove sound. ensures satisfy constant-time guarantee, while being free undefined behaviour. apply implement and verify functional correctness range concurrency primitives, including spinlock module, mixed-sensitivity mutex, multiple synchronous channel implementations. Empirical performance evaluations latter demonstrate SecRSL’s power support development secure performant concurrent C programs.